Implicit-shifted Symmetric QR Singular Value Decomposition of 3× 3 Matrices
نویسندگان
چکیده
Computing the Singular Value Decomposition (SVD) of 3× 3 matrices is commonplace in 3D computational mechanics and computer graphics applications. We present a C++ implementation of implicit symmetric QR SVD with Wilkinson shift. The method is fast and robust in both float and double precisions. We also perform a benchmark test to study the performance compared to other popular algorithms.
منابع مشابه
A Divide-and-Conquer Method for the Takagi Factorization
This paper presents a divide-and-conquer method for computing the Takagi factorization, or symmetric singular value decomposition, of a complex symmetric and tridiagonal matrix. An analysis of accuracy shows that our method produces accurate Takagi values and orthogonal Takagi vectors. Our preliminary numerical experiments have confirmed our analysis and demonstrated that our divide-and-conquer...
متن کاملA QR-method for computing the singular values via semiseparable matrices
A QR–method for computing the singular values via semiseparable matrices. Abstract The standard procedure to compute the singular value decomposition of a dense matrix, first reduces it into a bidiagonal one by means of orthogonal transformations. Once the bidiagonal matrix has been computed, the QR–method is applied to reduce the latter matrix into a diagonal one. In this paper we propose a ne...
متن کاملSingular-Value Decomposition via Gradient and Self-Equivalent Flows
The task of finding the singular-value decomposition (SVD) of a finite-dimensional complex Iinear operator is here addressed via gradient flows evolving on groups of complex unitary matrices and associated self-equivalent flows. The work constitutes a generalization of that of Brockett on the diagonalization of real symmetric matrices via gradient flows on orthogonal matrices and associated iso...
متن کاملA twisted factorization method for symmetric SVD of a complex symmetric tridiagonal matrix
This paper presents an O(n2) method based on the twisted factorization for computing the Takagi vectors of an n-by-n complex symmetric tridiagonal matrix with known singular values. Since the singular values can be obtained in O(n2) flops, the total cost of symmetric singular value decomposition or the Takagi factorization is O(n2) flops. An analysis shows the accuracy and orthogonality of Taka...
متن کاملNumerical solutions of symmetric saddle point problem by direct methods
Two new methods for solving the symmetric saddle point problem are proposed. The first one is a generalization of Golub’s method for the augmented system formulation (ASF) and uses the Householder QR decomposition. The second method is supported by the singular value decomposition (SVD). Numerical comparison of some direct methods are given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016